MEAN SOJOURN TIMES IN A MULTI-STAGE TANDEM QUEUE SERVED BY A SINGLE SERVER
نویسندگان
چکیده
منابع مشابه
MEAN TANDEM SOJOURN TIMES QUEUE SERVED IN A BY A Tsuyoshi Katayama MULTI - STAGE SINGLE SERVER
This paper presents explicit expressions for the mean sojourn times in a multi-stage tandem queue, with Poisson arrival and general service times, served by a s,ingle server with a cyclic switching rule, M/GI-G2-"'GN/l. The expressions are derived using the results of the two-stage tandem queue, M/GI-G2/1, already considered by some authors and the well-known Pollaczek-Khintchine formula. With ...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملConditional sojourn time of optimal scheduling policy in a multi - class single - server queue ⋆
Based on the groundbreaking result of Gittins on the multiarmed bandit problem we provide a characterization of the optimal nonanticipating scheduling policy in a multi-class single-server queue. We apply Gittins’ framework to characterize the optimal policy when the service time distribution of the various classes belong to the set of Decreasing Hazard Rate (DHR) distributions, like Pareto or ...
متن کاملSojourn time tails in the single server queue with heavy-tailed service times
We consider the GI/GI/1 queue with regularly varying service requirement distribution of index −α. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1 − α, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is regularly varying of index −α. That raises the question whether there exist service discipline...
متن کاملstochastic bounds for a single server queue with general retrial times
we propose to use a mathematical method based on stochastic comparisons of markov chains in order to derive performance indice bounds. the main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (fcfs) orbit and general retrial times using the stochastic ordering techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1988
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.31.233